Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars

نویسندگان

  • Henning Fernau
  • Dietmar Wätjen
چکیده

We continue the studies of the second author on regulated uniformly k-limited and regulated k-limited ET0L systems. We focus on the permitting and forbidding random context regulation. Especially, we establish some results on (regulated) propagating (uniformly) k-limited ET0L systems which were not solved in 2, 18, 21, 22]. Moreover, relations to recurrent programmed languages introduced by von Solms are exhibited. Supported by Deutsche Forschungsgemeinschaft grant DFG La 618/3-1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Unconditional Transfer

In this paper, we investigate the concept of unconditional transfer within various forms of regulated grammars like programmed grammars, matrix grammars, grammars with regular control, grammars controlled by bicoloured digraphs, and periodically time-variant grammars , especially regarding their descriptive capacity. Moreover, we sketch the relations to restricted parallel mechanisms like k-, u...

متن کامل

Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations

We consider regulated (n-dimensional) context-free array grammars of nite index, i.e., with a limited number of active areas. This research is motivated by the observation that in several practical applications of array grammars only such a bounded number of active areas is observed. Combined with diierent methods known from regulated rewriting (e.g., matrix grammars, programmed grammars, gramm...

متن کامل

Simple Semi-conditional Et0l Grammars

The present contribution introduces and studies simple semi-conditional ET0L grammars (SSC-ET0L grammars for short). It is demonstrated that SSC-ET0L grammars with permitting and forbidding conditions of length no more than one and two, respectively, generate all the family of recursively enumerable languages; if erasing productions are not allowed, these grammars generate precisely the family ...

متن کامل

Applications of L systems to group theory

L systems generalise context-free grammars by incorporating parallel rewriting, and generate languages such as EDT0L and ET0L that are strictly contained in the class of indexed languages. In this paper we show that many of the languages naturally appearing in group theory, and that were known to be indexed or context-sensitive, are in fact ET0L and in many cases EDT0L. For instance, the langua...

متن کامل

Synchronous Formal Systems Based on Grammars and Transducers

This paper is an extended abstract of a doctoral thesis which studies synchronous formal systems based on grammars and transducers, investigating both theoretical properties and practical application perspectives. It introduces new concepts and definitions building upon the well-known principles of regulated rewriting and synchronization. An alternate approach to synchronization of context-free...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 194  شماره 

صفحات  -

تاریخ انتشار 1998